CLODs: Dual Hierarchies for Multiresolution Collision Detection
نویسندگان
چکیده
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual hierarchy”, both a multiresolution representation of the original model and its bounding volume hierarchy for accelerating collision queries. We have proposed various error metrics, including object-space errors, velocity dependent gap, screen-space errors and their combinations. At runtime, our algorithm uses these error metrics to select the appropriate levels of detail independently at each potential contact location. Compared to the existing exact collision detection algorithms, we observe significant performance improvement using CLODs on some benchmarks, with little degradation in the visual rendering of simulations.
منابع مشابه
Dual Adaptive Paths for Multiresolution Hierarchies
The recent increase in the generated polygonal dataset sizes has outpaced the performance of graphics hardware. Several solutions such as multiresolution hierarchies and level-of-detail rendering have been developed to bridge the increasing gap. However, the discrete levels of detail generate annoying popping effects, the preliminaries multiresolution schemes cannot perform drastic changes on t...
متن کاملCollision Detection in Densely Packed Fiber Assemblies with Application to Hair Modeling
In this paper we investigate the application of bounding volume hierarchies in collision detection among densely packed fiber assemblies like hair strands or cable looms. In particular, we glance at collision detection algorithms with sub-quadratic upper bound and their practicability and performance in complex dynamic hair scenes. Unlike common collision detection techniques our approach explo...
متن کاملEfficient Bounding Volume Hierarchies for Hair Simulation
We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approac...
متن کاملCollision Detection Using Bounding-Volume Hierarchies in Urban Simulation
Performing fast and accurate collision detection between geometric models is still most open problems in modeling, robotics, manufacturing and computer-simulated environments. Most of previous method seems to have their own specification and restricted to a specific geometric models. For example, convex polytopes tend to solve accuracy problems but left behind the speed of collision detection. ...
متن کاملEfficient Collision and Self-Collision Detection for Humanoids Based on Sphere Tree Hierarchies
We present an algorithm for computing compact sphere tree hierarchies over general 3D polygonal meshes for the purpose of efficient collision detection and minimum distance computation. The sphere tree construction method we use optimizes the location of the sphere centers and radii at each level of the hierarchy to compactly contain the underlying geometry. We enhance the hierarchy constructio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003